A Note on Recognizable Sets of Unranked and Unordered Trees
نویسنده
چکیده
Recognizable sets of unranked, unordered trees have been introduced in Courcelle [C89] in a Myhill-Nerode [N58] style of inverse homomorphisms of suitable finite magmas. This is equivalent of being the the union of some congruence classes of a congruence of finite index. We will add to the well-known concept of regular tree grammars a handling of nodes labeled with ǫ. With this rather unconventional but nevertheless natural treatment of the ”empty node” the class of languages generated by regular trees grammars becomes equivalent to Courcelles class of recognizable sets of unranked, unordered trees.
منابع مشابه
A note on monadic datalog on unranked trees
In the article Recursive queries on trees and data trees (ICDT’13), Abiteboul et al. asked whether the containment problem for monadic datalog over unordered unranked labeled trees using the child relation and the descendant relation is decidable. This note gives a positive answer to this question, as well as an overview of the relative expressive power of monadic datalog on various representat...
متن کاملSome Examples of Semi-rational and Non-semi-rational DAG Languages. Extended Version
The class of semi-rational dag (d irected acyclic graph) languages can be equivalently characterized by labeled Petri nets with ε-transitions, by rather simple leave substituting tree grammars with additional non-local merge rules, or as a synchronization closure of Courcelles class of recognizable sets of unranked, unordered trees. However, no direct recognition by some magma is known. For a b...
متن کاملFinding Your Way in a Forest: On Different Types of Trees and Their Properties
We see trees in almost any part of computer science. Traditionally, ranked trees, that are nothing else but terms, captured most attention, although exceptions could have been found in graph theory or linguistics [9]. Recently unranked trees are a subject of renewed interest, mainly because of the developement of XML [22]. It is also quite comon nowadays to see trees with infinite paths, especa...
متن کاملSeries, Weighted Automata, Probabilistic Automata and Probability Distributions for Unranked Trees
We study tree series and weighted tree automata over unranked trees. The message is that recognizable tree series for unranked trees can be defined and studied from recognizable tree series for binary representations of unranked trees. For this we prove results of [1] as follows. We extend hedge automata – a class of tree automata for unranked trees – to weighted hedge automata. We define weigh...
متن کاملFinite Automata on Unranked and Unordered DAGs Extented Version
We introduce linear expressions for unrestricted dags (directed acyclic graphs) and finite deterministic and nondeterministic automata operating on them. Those dag automata are a conservative extension of the Tu,u-automata of Courcelle on unranked, unordered trees and forests. Several examples of dag languages acceptable and not acceptable by dag automata and some closure properties are given.
متن کامل